XML schema validation using parsing expression grammars
نویسندگان
چکیده
Schema validation is an integral part of reliable information exchange on the Web. However, implementing an efficient schema validation tool is not easy. We highlight the use of parsing expression grammars (PEGs), a recognition-based foundation for describing syntax, and apply it to the XML/DTD validation. This paper shows that structural schema constraints in document type definitions (DTDs) can be validated by the converted PEGs with the linear time and constant space consumption. We study the performance of several existing PEG-based tools, and then confirm that the converted PEGs achieve a practical and even competitive level of performance under existing standard XML/DTD validators.
منابع مشابه
A Compiler-Based Approach to Schema-Specific XML Parsing
The validation of XML instances against a schema is usually performed separately from the parsing of the more basic syntactic aspects of XML. We posit, however, that schema information can be used during parsing to improve performance, using what we call schema-specific parsing. This paper develops a framework for schema-specific parsing centered on an intermediate representation we call genera...
متن کاملXML to Relational Conversion Using Theory of Regular Tree Grammars
In this paper, we study the different steps of translation from XML to relational models, while maintaining semantic constraints. Our work is based on the theory of regular tree grammars, which provides a useful formal framework for understanding various aspects of XML schema languages. We first study two normal form representations for regular tree grammars. The first normal form representatio...
متن کاملGeneration of efficient parsers through direct compilation of XML Schema grammars
E. Perkins M. Matsa M. G. Kostoulas A. Heifets N. Mendelsohn With the widespread adoption of SOAP and Web services, XML-based processing, and parsing of XML documents in particular, is becoming a performance-critical aspect of business computing. In such scenarios, XML is often constrained by an XML Schema grammar, which can be used during parsing to improve performance. Although traditional gr...
متن کاملFast, Flexible, and Declarative Construction of Abstract Syntax Trees with PEGs
We address a declarative construction of abstract syntax trees with Parsing Expression Grammars. AST operators (constructor, connector, and tagging) are newly defined to specify flexible AST constructions. A new challenge coming with PEGs is the consistency management of ASTs in backtracking and packrat parsing. We make the transaction AST machine in order to perform AST operations in the conte...
متن کاملReasoning about Xml Schema Languages Using Formal Language Theory
A mathematical framework using formal language theory to describe and compare XML schema languages is presented. Our framework uses the work in two related areas { regular tree languages CDG + 97] and ambiguity in regular expressions BEGO71, BKW98]. Using these work as well as the content in two classical references HU79, AU79], we present the following results: (1) a normal form representation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- PeerJ PrePrints
دوره 3 شماره
صفحات -
تاریخ انتشار 2015